Towards Symbolic Analysis of Model Transformations

نویسنده

  • Dániel Varró
چکیده

As the Unified Modeling Language is evolving into a family of languages with individually specified semantics, there is an increasing need for highly automated and provenly correct model transformations that assure the integration of local views of the system (in the form of different diagrams) into a consistent global view. Graph transformation provides an easy-to-understand visual specification technique to formally capture the rules of such transformations. In the paper, we propose a model checking based verification approach for the general purpose model transformation system VIATRA by transforming model transition systems [14] into SAL specifications [1] to provide access for a combination of symbolic analysis techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear Symbolic Transformations for Simplifying Optimization Problems

The theory of nonlinear optimization traditionally studies numeric computations. However, increasing attention is being paid to involve computer algebra into mathematical programming. One can identify two possibilities of applying symbolic techniques in this field. Computer algebra can help the modeling phase by producing alternate mathematical models via symbolic transformations. The present p...

متن کامل

An Efficient Method to Solve the Mathematical Model of HIV Infection for CD8+ T-Cells

In this paper, the mathematical model of HIV infection for CD8+ T-cells is illustrated. The homotopy analysis method and the Laplace transformations are combined for solving this model. Also, the convergence theorem is proved to demonstrate the abilities of presented method for solving non-linear mathematical models. The numerical results for $N=5, 10$ are presented. Several $hbar$-c...

متن کامل

Fractal Symbolic Analysis for Program Transformations

Restructuring compilers use dependence analysis to prove that the meaning of a program is not changed by a transformation. A well-known limitation of dependence analysis is that it examines only the memory locations read and written by a statement, and does not assume any particular interpretation for the operations in that statement. Exploiting the semantics of these operations enables a wider...

متن کامل

Towards Symbolic Causality Checking using SAT-Solving

With the increasing size and complexity of modern safety critical embedded systems, the need for automated analysis methods is growing as well. Causality Checking is an automated technique for formal causality analysis of system models. In this paper we report on work in progress towards an Symbolic Causality Checking approach. The proposed approach is based on bounded model checking using SAT ...

متن کامل

Logic Bug Detection and Localization Using Symbolic Quick Error Detection

We present Symbolic Quick Error Detection (Symbolic QED), a structured approach for logic bug detection and localization which can be used both during pre-silicon design verification as well as post-silicon validation and debug. This new methodology leverages prior work on Quick Error Detection (QED) which has been demonstrated to drastically reduce the latency, in terms of the number of clock ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002